Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n²) barrierDEMETRESCU, Camil; ITALIANO, Giuseppe F.Journal of the Association for Computing Machinery. 2005, Vol 52, Num 2, pp 147-156, issn 0004-5411, 10 p.Article

1998 European Symposium on AlgorithmsBILARDI, Gianfranco; ITALIANO, Giuseppe F.Journal of algorithms (Print). 2003, Vol 49, Num 1, issn 0196-6774, 216 p.Conference Proceedings

Sorting and Searching in Faulty MemoriesFINOCCHI, Irene; ITALIANO, Giuseppe F.Algorithmica. 2008, Vol 52, Num 3, pp 309-332, issn 0178-4617, 24 p.Article

Mantaining Dynamic Matrices for Fully Dynamic Transitive ClosureDEMETRESCU, Camil; ITALIANO, Giuseppe F.Algorithmica. 2008, Vol 51, Num 4, pp 387-427, issn 0178-4617, 41 p.Article

Automata, languages and programming (ICALP 2005)ITALIANO, Giuseppe F; PALAMIDESSI, Catuscia.Theoretical computer science. 2007, Vol 380, Num 1-2, issn 0304-3975, 220 p.Conference Proceedings

Designing reliable algorithms in unreliable memoriesFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2005, pp 1-8, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

Optimal Resilient Sorting and Searching in the Presence of Memory FaultsFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2006, pp 286-298, issn 0302-9743, isbn 3-540-35904-4, 13 p.Conference Paper

Algorithms and constraint programmingGRANDONI, Fabrizio; ITALIANO, Giuseppe F.Lecture notes in computer science. 2006, pp 2-14, issn 0302-9743, isbn 3-540-46267-8, 1Vol, 13 p.Conference Paper

Improved Approximation for Single-Sink Buy-at-BulkGRANDONI, Fabrizio; ITALIANO, Giuseppe F.Lecture notes in computer science. 2006, pp 111-120, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Improved algorithms for max-restricted path consistencyGRANDONI, Fabrizio; ITALIANO, Giuseppe F.Lecture notes in computer science. 2003, pp 858-862, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

Small stretch spanners on dynamic graphsAUSIELLO, Giorgio; FRANCIOSA, Paolo G; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2005, pp 532-543, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Algorithms and complexity (6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006)Calamoneri, Tiziana; Finocchi, Irene; Italiano, Giuseppe F et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-34375-X, 1Vol, XII-394 p, isbn 3-540-34375-XConference Proceedings

Maximizing job completions onlineKALYANASUNDARAM, Bala; PRUHS, Kirk R.Journal of algorithms (Print). 2003, Vol 49, Num 1, pp 63-85, issn 0196-6774, 23 p.Conference Paper

Δ-stepping: a parallelizable shortest path algorithmMEYER, U; SANDERS, P.Journal of algorithms (Print). 2003, Vol 49, Num 1, pp 114-152, issn 0196-6774, 39 p.Conference Paper

Small stretch (α, β)-spanners in the streaming modelAUSIELLO, Giorgio; FRANCIOSA, Paolo G; ITALIANO, Giuseppe F et al.Theoretical computer science. 2009, Vol 410, Num 36, pp 3406-3413, issn 0304-3975, 8 p.Article

New up-to techniques for weak bisimulationPOUS, Damien.Theoretical computer science. 2007, Vol 380, Num 1-2, pp 164-180, issn 0304-3975, 17 p.Conference Paper

Engineering and visualizing algorithmsDEMETRESCU, Camil; FINOCCHI, Irene; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2003, pp 509-513, issn 0302-9743, isbn 3-540-20831-3, 5 p.Conference Paper

Approximate coloring of uniform hypergraphsKRIVELEVICH, Michael; SUDAKOV, Benny.Journal of algorithms (Print). 2003, Vol 49, Num 1, pp 2-12, issn 0196-6774, 11 p.Conference Paper

Discrete random variables over domainsMISLOVE, Michael.Theoretical computer science. 2007, Vol 380, Num 1-2, pp 181-198, issn 0304-3975, 18 p.Conference Paper

Parameterized algorithms for HITTING SET : The weighted caseFERNAUL, Henning.Lecture notes in computer science. 2006, pp 332-343, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

On broadcast scheduling with limited energyGUNIA, Christian.Lecture notes in computer science. 2006, pp 151-162, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is smallKULKARNI, Raghav.Lecture notes in computer science. 2006, pp 308-319, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Counting all solutions of minimum weight exact satisfiabilityPORSCHEN, Stefan.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 10 p.Conference Paper

On the hardness of range assignment problemsFUCHS, Bernhard.Lecture notes in computer science. 2006, pp 127-138, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

A near optimal scheduler for on-demand data broadcastsTING, Hing-Fung.Lecture notes in computer science. 2006, pp 163-174, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper